Linear Discrete Pursuit Game with Phase Constraints
نویسندگان
چکیده
منابع مشابه
Linear Discrete Pursuit Game with Phase Constraints
We consider a linear pursuit game of one pursuer and one evader whose motions are described by different-type linear discrete systems. Position of the evader satisfies phase constraints: y∈G, where G is a subset of Rn. We considered two cases: (1) controls of the players satisfy geometric constraints, and (2) controls of the players satisfy total constraints. Terminal set M is a subset of Rn an...
متن کاملFixed Duration Pursuit-Evasion Differential Game with Integral Constraints
We investigate a pursuit-evasion differential game of countably many pursuers and one evader. Integral constraints are imposed on control functions of the players. Duration of the game is fixed and the payoff of the game is infimum of the distances between the evader and pursuers when the game is completed. Purpose of the pursuers is to minimize the payoff and that of the evader is to maximize ...
متن کاملFully fuzzy linear programming with inequality constraints
Fuzzy linear programming problem occur in many elds such as mathematical modeling, Control theory and Management sciences, etc. In this paper we focus on a kind of Linear Programming with fuzzy numbers and variables namely Fully Fuzzy Linear Programming (FFLP) problem, in which the constraints are in inequality forms. Then a new method is proposed to ne the fuzzy solution for solving (FFLP). Nu...
متن کاملMinimizing Discrete Convex Functions with Linear Inequality Constraints
A class of discrete convex functions that can efficiently be minimized has been considered by Murota. Among them are L\-convex functions, which are natural extensions of submodular set functions. We first consider the problem of minimizing an L\-convex function with a linear inequality constraint having a positive normal vector. We propose a polynomial algorithm to solve it based on a binary se...
متن کاملOn the Existence of Nash Equilibrium for a Two Player Pursuit-Evasion Game with Visibility Constraints
In this paper, we present a game theoretic analysis of a visibility based pursuitevasion game in a planar environment containing obstacles. The pursuer and the evader are holonomic having bounded speeds. Both the players have a complete map of the environment. Both the players have omnidirectional vision and have knowledge about each other’s current position as long as they are visible to each ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Scientific World Journal
سال: 2014
ISSN: 2356-6140,1537-744X
DOI: 10.1155/2014/435103